Issues in the Development of Global Optimization Algorithms for Bilevel Programs with a Nonconvex Inner Program
نویسنده
چکیده
The co-operative formulation of a nonlinear bilevel program involving nonconvex functions is considered and two equivalent reformulations to simpler programs are presented. It is shown that previous literature proposals for the global solution of such programs are not generally valid for nonconvex inner programs and several consequences of nonconvexity in the inner program are identified. In particular, issues with the computation of lower and upper bounds as well as with the choice of branching variables in a branch-andbound framework are analyzed. This analysis lays the foundation for the development of rigorous algorithms and some algorithmic expectations are established. Key-words Bilevel program; nonconvex; global optimization; GSIP; branch-and-bound AMS Classification http://www.ams.org/msc/ 65K05=mathematical programming algorithms 90C26=nonconvex programming 90c33=complementarity programming 90C31=sensitivity,stability,parametric optimization
منابع مشابه
On solving simple bilevel programs with a nonconvex lower level program
In this paper, we consider a simple bilevel program where the lower level program is a nonconvex minimization problem with a convex set constraint and the upper level program has a convex set constraint. By using the value function of the lower level program, we reformulate the bilevel program as a single level optimization problem with a nonsmooth inequality constraint and a convex set constra...
متن کاملBranch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
We present a global optimization algorithm, Branch-and-Sandwich, for optimistic bilevel programming problems which satisfy a regularity condition in the inner problem. The functions involved are assumed to be nonconvex and twice continuously differentiable. The proposed approach can be interpreted as the exploration of two solution spaces (corresponding to the inner and the outer problems) usin...
متن کاملOptimization with Linear Complementarity Constraints
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem where a continuously differentiable function is minimized on a set defined by linear constraints and complementarity conditions on pairs of complementary variables. This problem finds many applications in several areas of science, engineering and economics and is also an important tool for the solu...
متن کاملPessimistic bilevel linear optimization
In this paper, we investigate the pessimistic bilevel linear optimization problem (PBLOP). Based on the lower level optimal value function and duality, the PBLOP can be transformed to a single-level while nonconvex and nonsmooth optimization problem. By use of linear optimization duality, we obtain a tractable and equivalent transformation and propose algorithms for computing global or local op...
متن کاملA smoothing augmented Lagrangian method for solving simple bilevel programs
In this paper, we design a numerical algorithm for solving a simple bilevel program where the lower level program is a nonconvex minimization problem with a convex set constraint. We propose to solve a combined problem where the first order condition and the value function are both present in the constraints. Since the value function is in general nonsmooth, the combined problem is in general a...
متن کامل